Efficient Block Codes for Error Correction Using Low Density Parity Check Codes
نویسندگان
چکیده
This paper presents a novel high-speed BCH (hamming) decoder that corrects single-bit errors in parallel and multiple-bit errors corrects serial manner. The proposed decoder is constructed by a novel design and is suitable for nanoscale memory systems, in which multiple-bit errors occur at a probability comparable to single-bit errors and multiple errors occur at a higher probability. To prevent such soft or transient fault related attacks, we consider fault tolerance as a method of mitigation. Most of the current fault tolerant schemes are only multiple bit error detectable but not multiple bit error correctable. This paper also shows that the area, delay, and power overheads incurred by the proposed scheme are significantly lower than traditional fully parallelized BCH based hamming decoders capable of correcting any multiple bit error. This error detection and correction algorithm is synthesized and simulated by using XILINX ISE.
منابع مشابه
Moderate-Density Parity-Check Codes
We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of one’s of the parity-check matrix of the codes presented is typically higher than the number of one’s of the parity-check matrix of low-density paritycheck (LDPC) codes. But, still lower than those of the parity-check matrix of classical block c...
متن کاملA Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design
In this paper we construct a class of regular Low Density Parity Check (LDPC) codes derived from Latin squares. The parity check matrices of these codes are constructed by permuting shift-orthogonal Latin squares of order n in blockrows and block-columns. I show that the constructed LDPC codes are self-orthogonal and their minimum and stopping distances are bounded. This helps us to construct a...
متن کاملA Memory Efficient -Fully Parallel QC-LDPC Encoder
Low-Density Parity Check codes are a special class of linear block codes widely used in communication and disk storage systems, due to their Shannon limit approaching performance and their favourable structure. A special class of LDPC codes, called QC-LDPC codes, allows for efficient hardware implementations of encoding and decoding algorithms by exploiting the structure of the Parity Check Mat...
متن کاملUnavoidable Cycles in Polynomial-Based Time-Invariant LDPC Convolutional Codes
Low-Density Parity-Check convolutional codes (LDPCccs) are very interesting for practical error-correction coding in wireless transmission as they have excellent performance and at the same time they allow for variable block size with low complexity encoding and decoding. As for all LDPC codes that are decoded by the sub-optimal (but highly efficient) Sum Product Algorithm, the cycles in the co...
متن کاملODING for error correction is one of the many tools available for achieving reliable data transmission in communication system[4].Low-density parity-check (LDPC) codes are a class of linear block LDPC codes[4]. LPDC codes
This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager. Keywords—LDPC, channel coding.
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کامل